In mathematics, a quintic function is a function of the form
where a, b, c, d, e and f are members of a field, typically the rational numbers, the real numbers or the complex numbers, and a is nonzero. In other words, a quintic function is defined by a polynomial of degree five.
Setting g(x) = 0 and assuming a ≠ 0 produces a quintic equation of the form:
If a is zero but one of the other coefficients is non-zero, the equation is classified as either a quartic equation, cubic equation, quadratic equation or linear equation.
Because they have an odd degree, normal quintic functions appear similar to normal cubic functions when graphed, except they may possess an additional local maximum and local minimum each. The derivative of a quintic function is a quartic function.
Contents |
Finding the roots of a polynomial—values of x which satisfy such an equation—in the rational case given its coefficients has been a prominent mathematical problem.
Solving linear, quadratic, cubic and quartic equations by factorization into radicals is fairly straightforward, no matter whether the roots are rational or irrational, real or complex; there are also formulae that yield the required solutions. However, there is no formula for general quintic equations over the rationals in terms of radicals; this is known as the Abel–Ruffini theorem, first published in 1824, which was one of the first applications of group theory in algebra. This result also holds for equations of higher degrees. An example quintic whose roots cannot be expressed by radicals is This quintic is in Bring–Jerrard normal form.
As a practical matter, exact analytic solutions for polynomial equations are often unnecessary, and so numerical methods such as Laguerre's method or the Jenkins-Traub method are probably the best way of obtaining solutions to general quintics and higher degree polynomial equations that arise in practice. However, analytic solutions are sometimes useful for certain applications, and many mathematicians have tried to develop them.
Some fifth-degree equations can be solved by factorizing into radicals; for example, , which can be written as , or , which has as solution. Other quintics like cannot be solved by radicals. Évariste Galois developed techniques for determining whether a given equation could be solved by radicals which gave rise to group theory and Galois theory. Applying these techniques, Arthur Cayley has found a general criterion for determining whether any given quintic is solvable.[1] This criterion is the following.[2]
Given the equation
the Tschirnhaus transformation , which depresses the quintic, gives the equation
where
Both equations are solvable by radicals if and only if either they are factorisable in equations of lower degrees with rational coefficients or the polynomial , named Cayley resolvent, has a rational root in z, where
and
In 1888, George Paxton Young[3] described how to solve a solvable quintic equation, without providing an explicit formula; Daniel Lazard writes out a three-page formula (Lazard (2004)).
During the second half of 19th century, John Stuart Glashan, George Paxton Young, and Carl Runge found that any irreducible quintic with rational coefficients in Bring-Jerrard form,
is solvable by radicals if and only if either a = 0 or it is of the following form:
where and are rational. In 1994, Blair Spearman and Kenneth S. Williams gave an alternative,
The relationship between the 1885 and 1994 parameterizations can be seen by defining the expression
where
and using the negative case of the square root yields, after scaling variables, the first parametrization while the positive case gives the second. It is then a necessary (but not sufficient) condition that the irreducible solvable quintic
with rational coefficients must satisfy the simple quadratic curve
for some rational .
The substitution , in Spearman-Williams parameterization allows to not exclude the special case a = 0, giving the following result:
If a and b are rational numbers, the equation is solvable by radicals if either its left hand side is a product of polynomials of degree less than 5 with rational coefficients or there exist two rational numbers l and m such that
A quintic is solvable using radicals if the Galois group of the quintic (which is a subgroup of the symmetric group S(5) of permutations of a five element set) is a solvable group. In this case the form of the solutions depends on the structure of this Galois group.
A simple example is given by the equation , whose Galois group is the group F(5) generated by the permutations "(1 2 3 4 5)" and "(1 2 4 3)"; the only real solution is
However, for other solvable Galois groups, the form of the roots can be much more complex. For example, the equation has Galois group D(5) generated by "(1 2 3 4 5)" and "(1 4)(2 3)" and the solution requires more symbols to write. Define,
where φ is the golden ratio , then the only real solution is exactly given by,
Or equivalently,
where the yi are the four roots of the quartic equation,
In general, if an equation P(x) = 0 of prime degree p with rational coefficients is solvable in radicals, there is an auxiliary equation Q(y) = 0 of degree (p-1) also with rational coefficients that can be used to solve the former.
However, it is possible some of the roots of Q(y) = 0 are rational (like in the F(5) example given above) or some as zero, like the solvable DeMoivre quintic,
where the auxiliary equation has two zero roots and is essentially just the quadratic,
such that the five roots of the DeMoivre quintic are given by,
where ωk is any of the five 5th roots of unity. This can be easily generalized to construct a solvable septic and other odd degrees, not necessarily prime.
Here is a list of known solvable quintics:
There are infinitely many solvable quintics in Bring-Jerrard form which have been parameterized in preceding section.
Up to the scaling of the variable, there is exactly five solvable quintics of the shape , which are[4] (where s is a scaling factor):
Paxton Young (1888) gave a number of examples, some of them being reducible, having a rational root:
Solution: | |
Reducible: −8 is a root | |
Reducible: −4 is a root | |
Reducible : -8 is a root | |
Reducible : 8 is a root | |
An infinite sequence of solvable quintics may be constructed, whose roots are sums of n-th roots of unity, with n = 10 k + 1 being a prime number:
Roots: | |
Root: | |
Root: | |
Root: | |
Root: |
There are also two parameterized families of solvable quintics: The Kondo–Brumer quintic,
and the family depending on the parameters
where
If the Galois group of a quintic is not solvable, then the Abel-Ruffini theorem tells us that to obtain the roots it is necessary to go beyond the basic arithmetic operations and the extraction of radicals. About 1835, Jerrard demonstrated that quintics can be solved by using ultraradicals (also known as Bring radicals), the real roots of for real numbers . In 1858 Charles Hermite showed that the Bring radical could be characterized in terms of the Jacobi theta functions and their associated elliptic modular functions, using an approach similar to the more familiar approach of solving cubic equations by means of trigonometric functions. At around the same time, Leopold Kronecker, using group theory developed a simpler way of deriving Hermite's result, as had Francesco Brioschi. Later, Felix Klein came up with a particularly elegant method that relates the symmetries of the icosahedron, Galois theory, and the elliptic modular functions that feature in Hermite's solution, giving an explanation for why they should appear at all, and develops his own solution in terms of generalized hypergeometric functions.[5] Similar phenomena occur in degree 7 (septic equations) and 11, as studied by Klein and discussed in icosahedral symmetry: related geometries.
|